2

Computational depth and reducibility

Year:
1994
Language:
english
File:
PDF, 2.09 MB
english, 1994
3

Weak completeness in E and E2

Year:
1995
Language:
english
File:
PDF, 464 KB
english, 1995
4

On the existence of subexponential parameterized algorithms

Year:
2003
Language:
english
File:
PDF, 249 KB
english, 2003
5

The inapproximability of non-NP-hard optimization problems

Year:
2002
Language:
english
File:
PDF, 172 KB
english, 2002
6

Weakly complete problems are not rare

Year:
1995
Language:
english
File:
PDF, 896 KB
english, 1995
7

The Complexity of Polynomial-Time Approximation

Year:
2007
Language:
english
File:
PDF, 253 KB
english, 2007
9

Completeness and Weak Completeness under Polynomial-Size Circuits

Year:
1996
Language:
english
File:
PDF, 906 KB
english, 1996
11

The Complexity and Distribution of Hard Problems

Year:
1995
Language:
english
File:
PDF, 1.77 MB
english, 1995
17

COMPUTATIONAL COMPLEXITY OF TERM-EQUIVALENCE

Year:
1999
Language:
english
File:
PDF, 803 KB
english, 1999
22

Set cover-based methods for motif selection

Year:
2019
Language:
english
File:
PDF, 1.93 MB
english, 2019